The generator matrix

 1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  1  X  X  X  X  X  X  X  X  0  0  0  0  1  1  1  1  1  1  1  1  1  X  X  X  X  X  0  X  X  X  X  X  0  0  0
 0  X  0  X  0  X 2X 2X 2X  0  0  X  X  0  X 2X 2X 2X  0  0  X  X  0  X 2X 2X 2X  0  0  X  X  0  X 2X 2X 2X  0  0  X  X  0  X 2X 2X 2X  0  X  X  X  0 2X 2X 2X  X  X  X  0  0  0  X  X  0  X 2X 2X 2X  0  0  X 2X  0  X  X  X 2X 2X  0  X  X  0
 0  0  X 2X 2X  X  0  X 2X  0  X 2X  X 2X  0  0  X 2X  0  X 2X  X 2X  0  0  X 2X  0  X 2X  X 2X  0  0  X 2X  0  X 2X  X 2X  0  0  X 2X  X 2X  X  0 2X  0  X 2X  0  X 2X  X  0  X 2X  X 2X  0  0  X 2X  X 2X 2X  X  0 2X  X  0  0 2X  0  0  X  X

generates a code of length 80 over Z3[X]/(X^2) who´s minimum homogenous weight is 162.

Homogenous weight enumerator: w(x)=1x^0+80x^162

The gray image is a linear code over GF(3) with n=240, k=4 and d=162.
As d=162 is an upper bound for linear (240,4,3)-codes, this code is optimal over Z3[X]/(X^2) for dimension 4.
This code was found by Heurico 1.16 in 0.0825 seconds.